- graph reduction
- вчт1) редукция графа; приведение графа к нормальной форме2) метод программирования, основанный на приведении графа к нормальной форме
English-Russian electronics dictionary .
graph reduction
Смотреть что такое "graph reduction" в других словарях:
Graph reduction — In computer science, graph reduction implements an efficient version of non strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non strict evaluation is also known as lazy… … Wikipedia
Graph reduction machine — A graph reduction machine is a special purpose computer built to perform combinator calculations by graph reduction.Examples include the SKIM ( S K I machine ) computer, built at the University of Cambridge Computer Laboratory, and the… … Wikipedia
Reduction — Reduction, reduced, or reduce may refer to:cienceChemistry*Reduction – chemical reaction in which atoms have their oxidation number (oxidation state) changed. **Reduced gas – a gas with a low oxidation number **Ore reduction: see… … Wikipedia
réduction — [ redyksjɔ̃ ] n. f. • fin XIIIe « rapprochement »; lat. reductio, de reducere → réduire I ♦ (XIVe) Opération qui consiste à remettre en place (un os luxé, fracturé; un organe déplacé). Réduction d une articulation luxée. Par ext. Réduction d une… … Encyclopédie Universelle
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Reduction system — In mathematics, a reduction system is a system where terms can be re written by using a finte list of rewriting rules.Examples of reduction systems include string rewriting systems, term rewriting systems, lambda calculus under lambda conversion … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Nonlinear dimensionality reduction — High dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies on an embedded non linear manifold within… … Wikipedia
Transitive reduction — In mathematics, the transitive reduction of a binary relation R on a set X is a minimal relation R on X such that the transitive closure of R is the same as the transitive closure of R . If the transitive closure of R is antisymmetric and finite … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
